太空信息支援指挥控制支持平台构建初探

针对当前太空信息支援指挥控制存在的诸如缺少统一平台进行需求综合、数据汇集和融合处理,各类数据和产品分散管理,分头为用户提供信息保障服务等现实问题,本文对太空信息支援指挥控制相关问题进行了研究,构建了太空信息支援指挥控制任务模型,并对太空信息支援指挥控制任务进行了分析。按照系统结构设计的思想,从太空信息资源提供者、太空信息资源使用者和太空信息系统管理者三个角度提出了太空信息支援指挥控制支持平台的功能需求;研究了太空信息支援指挥控制支持平台的系统组成,并按照"资源+服务+应用"的设计原则构建底层可共用基础平台,中间层提供支撑软件集成,上层面向各级各类用户系统的支持平台技术架构和相应物理架构,解决了指挥控制支持平台"建什么、怎么建"的关键问题,可为太空信息支援指挥控制支持平台设计提供理论参考。     

基于蚂蚁聚类算法的炮兵阵地选取方法

在对炮兵作战地域进行地形分析的基础上,提出运用蚂蚁聚类算法选取炮兵阵地的方法.针对炮兵阵地配置的特殊要求,将模糊数学中的隶属度概念引入到炮兵阵地聚类算法之中.最后通过实验分析了此方法的优缺点,对炮兵指挥决策有一定的参考价值.     

一种用于机电产品测试性设计的传感器优选MINLP模型

在单故障假设条件下,考虑了传感器的失效概率和设备的故障率,提出一种以故障检测率和故障隔离率为约束条件的降低传感器费用和失效概率的混合整数非线性规划(MINLP)模型,从而为机电产品测试性设计中传感器选择问题提供了一种可行和有效的解决方法,并进行了案例验证,说明了该方法的有效性。     

空间信息栅格体系与服务聚合技术

空间信息应用中存在的数据海量、分布异构、处理复杂、计算密集等问题制约了空间数据和信息的广泛共享和应用。空间信息栅格(SIG)以Grid和WebServices技术为核心,共享并汇集地理上分布的海量空间信息资源,实现动态整合与集成。在构建开放性SIG七层应用体系的基础上,重点研究SIG服务聚合技术,基于Petri网和图论提出了一种新的服务聚合流程模型(服务/资源网),同时构建了可扩展的服务动态选择模型(SISM),实现服务聚合过程中的动态服务选择。结合国家地质调查业务应用,通过地下水资源评价应用实例对SIG的实用性和有效性进行了验证。     

基于EV模型的惯导平台误差分离方法

针对惯导平台误差分离过程中输入输出观测数据均含有噪声的问题,应用基于EV模型的总体最小二乘方法进行误差分离.给出了惯导平台的误差模型及误差观测方程,介绍了EV模型及总体最小二乘方法,分析了利用车载试验进行误差分离时平台的安装方式以及所需的外测信号等问题.应用最小二乘法和总体最小二乘法进行仿真对比研究.仿真结果表明,基于EV模型的总体最小二乘法对惯导平台的误差系数分离精度较最小二乘法要高.     

适用于捷联惯性/星光组合导航的导航星表构建方法

构建满足完备性、精简性和查询快速性的导航星表是实现捷联惯性/星光组合导航系统的重要前提和保证。为了达到这一目标，本文选取天文学中的Tycho-2星表作为导航星表的初始星表，它与TRC星表相比具有明显的优势，在实践运用过程中更加完备。在Tycho-2星表基础上，对球矩形分区方法进行了改进，包括明确了分区及子分区的划分方法，提出了备选导航星的选择策略。实验结果表明，采用改进型球矩形分区方法的备选导航星数量最多只占赤纬带法导航星的19.39%，仅占全天遍历法导航星的3.12%。因此，改进型球矩形分区方法更加精准，查询更快捷，更适用于SINS/CNS组合导航系统。     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

65纳米工艺双层三维静态存储器的软错误分析与评估

首先搭建了3D SRAM软错误分析平台,可以快速、自动分析多层die堆叠结构3D SRAM的软错误特性。此平台集成了多种层次模拟软件Geant4、TCAD、Nanosim,数据记录处理软件ROOT,版图处理软件Calibre,以及用于任务链接和结果分析的Perl和shell脚本。利用该平台,对以字线划分设计的3D SRAM和同等规模的2D SRAM分别进行软错误分析,并对分析结果进行了对比。对比分析表明2D 和3D SRAM的翻转截面几乎相同,但3D SRAM单个字中发生的软错误要比2D SRAM更严重,导致难以使用ECC技术对其进行加固。静态模式下2D SRAM和3D SRAM敏感节点均分布于存储阵列中,表明静态模式下逻辑电路不会引发软错误。